The (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs
نویسندگان
چکیده
Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition theorems for hereditary graph classes. In this paper, we prove two structure theorems: one for graphs with no thetas, wheels and prisms as induced subgraphs, and one for graphs with no thetas, wheels and pyramids as induced subgraphs. A consequence is a polynomial time recognition algorithms for these two classes. In Part II of this series we generalize these results to graphs with no thetas and wheels as induced subgraphs, and in Parts III and IV, using the obtained structure, we solve several optimization problems for these graphs. AMS classification: 05C75
منابع مشابه
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs
In this paper we study the class of graphs C defined by excluding the following structures as induced subgraphs: thetas, pyramids, 1-wheels and 3-wheels. We describe the structure of graphs in C, and we give a polynomial-time recognition algorithm for this class. We also prove that K4-free graphs in C are 4-colorable. We remark that C includes the class of chordal graphs, as well as the class o...
متن کاملON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS
Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.
متن کاملDefective Choosability of Graphs without Small Minors
For each proper subgraph H of K5, we determine all pairs (k, d) such that every H-minor-free graph is (k, d)-choosable or (k, d)-choosable. The main structural lemma is that the only 3-connected (K5 − e)-minor-free graphs are wheels, the triangular prism, and K3,3; this is used to prove that every (K5 − e)-minor-free graph is 4-choosable and (3, 1)-choosable.
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملOn 4-critical t-perfect graphs
It is an open question whether the chromatic number of t-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical t-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism Π (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this pa...
متن کامل